home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: news.dcs.warwick.ac.uk!not-for-mail
- From: D.C.Molero@dcs.warwick.ac.uk (danny)
- Subject: polyg. inters. in C
- X-Nntp-Posting-Host: sword
- Message-ID: <1996Apr2.151123.3829@dcs.warwick.ac.uk>
- Sender: news@dcs.warwick.ac.uk (Network News)
- Organization: Department of Computer Science, Warwick University, England
- Date: Tue, 2 Apr 1996 15:11:23 GMT
-
- Dear Readers,
-
- I have what to me seems a complicated algorithmic problem and would
- like very much to hear your suggestions.
-
- Given two polygons A and B, is it possible to know whether B is
- contained in A, with possibly A and B sharing some sides ?
- If so, is it possible to calculate A - B, that is, the polygon obtained
- when the intersection of A and B is substracted from A ??
-
- I haven't found any bibliography dealing with it.
-
- I would need some C code to solve it, so C code itself or pseudocode, or
- any refernce to any materials where I can find the solution, would be
- greatly appreciated.
-
- Thank you for reading my message.
-
- --
- * Daniel Castillo. danmol@dcs.warwick.ac.uk *
-
-
-